Pareto-like sequential sampling heuristic for global optimisation
نویسندگان
چکیده
منابع مشابه
Global Optimisation of Neural Network Models via Sequential Sampling
We propose a novel strategy for training neural networks using sequential sampling-importance resampling algorithms. This global optimisation strategy allows us to learn the probability distribution of the network weights in a sequential framework. It is well suited to applications involving on-line, nonlinear, non-Gaussian or non-stationary signal processing.
متن کاملGlobal optimisation of neural network models via sequential sampling-importance resampling
We propose a novel strategy for training neural networks using sequential Monte Carlo algorithms. This global optimisation strategy allows us to learn the probability distribution of the network weights in a sequential framework. It is well suited to applications involving on-line, nonlinear or non-stationary signal processing. We show how the new algorithms can outperform extended Kalman lter ...
متن کاملHeuristic optimisation
1. The computational complexity of many problems means that optimal solutions are unlikely to be found in reasonable time in larger instances. 2. Problems may be ill-defined or data imprecise, so that an optimal solution based on estimated data will almost certainly not be optimal for the actual data. In such a situation it is preferable to obtain a robust solution that will be near-optimal ove...
متن کاملOn Sequential Sampling for Global Metamodeling in Engineering Design
Approximation models (also known as metamodels) have been widely used in engineering design to facilitate analysis and optimization of complex systems that involve computationally expensive simulation programs. The accuracy of metamodels is directly related to the sampling strategies used. Our goal in this paper is to investigate the general applicability of sequential sampling for creating glo...
متن کاملGlobal Sampling for Sequential Filtering over Discrete State Space
In many situations, there is a need to approximate a sequence of probability measures over a growing product of finite spaces. Whereas it is in general possible to determine analytic expressions for these probability measures, the number of computations needed to evaluate these quantities grows exponentially thus precluding real-time implementation. Sequential Monte Carlo techniques (SMC), whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2021
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-021-05853-8